翻訳と辞書 Words near each other ・ Stobrawa (potato) ・ Stobrawa Landscape Park ・ Stobrawa, Opole Voivodeship ・ Stobreč ・ Stobrum ・ Stobswell ・ Stoby ・ Stocaigh ・ Stoccareddo ・ Stocco ・ Stoch ・ Stochastic ・ Stochastic approximation ・ Stochastic block model ・ Stochastic calculus ・ Stochastic cellular automaton ・ Stochastic computing ・ Stochastic context-free grammar ・ Stochastic control ・ Stochastic cooling ・ Stochastic differential equation ・ Stochastic diffusion search ・ Stochastic discount factor ・ Stochastic dominance ・ Stochastic drift ・ Stochastic electrodynamics ・ Stochastic Empirical Loading and Dilution Model ・ Stochastic equicontinuity ・ Stochastic Eulerian Lagrangian method ・ Stochastic forensics Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Stochastic cellular automaton ： ウィキペディア英語版 Stochastic cellular automaton Stochastic cellular automata or 'probabilistic cellular automata' (PCA) or 'random cellular automata' or locally interacting Markov chains are an important extension of cellular automaton. Cellular automata are a discrete-time dynamical system of interacting entities, whose state is discrete. The state of the collection of entities is updated at each discrete time according to some simple homogeneous rule. All entities' states are updated in parallel or synchronously. Stochastic Cellular Automata are CA whose updating rule is a stochastic one, which means the new entities' states are chosen according to some probability distributions. It is a discrete-time random dynamical system. From the spatial interaction between the entities, despite the simplicity of the updating rules, complex behaviour may emerge like self-organization. As mathematical object, it may be considered in the framework of stochastic processes as an interacting particle system in discrete-time. == PCA as Markov stochastic processes == As discrete-time Markov process, PCA are defined on a product space $E=\backslash prod\_\; S\_k$ (cartesian product) where $G$ is a finite or infinite graph, like $\backslash mathbb\; Z$ and where $S\_k$ is a finite space, like for instance $S\_k=\backslash$ or $S\_k=\backslash$. The transition probability has a product form $P(d\backslash sigma\; |\; \backslash eta)\; =\; \backslash otimes\_\; p\_k(d\backslash sigma\_k\; |\; \backslash eta)$ where $\backslash eta\; \backslash in\; E$ and $p\_k(d\backslash sigma\_k\; |\; \backslash eta)$ is a probability distribution on $S\_k$. In general some locality is required $p\_k(d\backslash sigma\_k\; |\; \backslash eta)=p\_k(d\backslash sigma\_k\; |\; \backslash eta\_)$ where $\backslash eta\_=(\backslash eta\_j)\_$ with $$ a finite neighbourhood of k. See 〔(P.-Y. Louis PhD )〕 for a more detailed introduction following the probability theory's point of view. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Stochastic cellular automaton」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.